Memetic algorithm for minimum energy broadcast problem in wireless ad hoc networks
نویسندگان
چکیده
The problem of finding a broadcast tree with minimum power consumption has received much attention due to two reasons. They are (a) the limited bandwidth of wireless networks and (b) the nodes are battery operated. This work proposes heuristic memetic algorithm to find minimum energy broadcast tree in wireless ad hoc networks. The simulation results on numerous problem instances confirm that the proposed algorithm significantly outperforms several heuristic algorithms in terms of solution quality. The experimental evaluation of the memetic algorithm shows that it generally improves over other recently proposed algorithms. By solving well-known benchmark problem instances with 20 and 50 nodes, it also demonstrates the effectiveness of memetic algorithm in terms of computation time. & 2013 Elsevier B.V. All rights reserved.
منابع مشابه
Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملMemetic Algorithm for Minimum Energy Broadcast Problem
A heuristic memetic algorithm for the minimum energy broadcasting problem in wireless ad hoc networks is discussed in this chapter. Broadcasting in wireless networks is different from broadcasting in wired networks because every node in wireless networks is equipped with omnidirectional antennas and several nodes are covered in a single transmission. Each node within the transmission range of t...
متن کاملEnergy Efficient Routing in Mobile Ad Hoc Networks by Using Honey Bee Mating Optimization
Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...
متن کاملEnergy Efficient Routing in Mobile Ad Hoc Networks by Using Honey Bee Mating Optimization
Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...
متن کاملEnergy-efficient broadcast and multicast routing in multihop ad hoc wireless networks
This paper addresses the problem of broadcasting and multicasting in large scale multihop ad hoc wireless networks. We focus on the energy-efficient broadcast routing in stationary networks and consider the case where wireless nodes can dynamically control their transmission power for each broadcast session. Minimum spanning tree (MST) has the property that the longest edge in the tree is the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Swarm and Evolutionary Computation
دوره 12 شماره
صفحات -
تاریخ انتشار 2013